منابع مشابه
An applicative theory for FPH
In this paper we define an applicative theory whose provably total functions are those which belong to the polynomial hierarchy of time. Considering theories which characterize classes of computational complexity, there are three different approaches: in one, the functions which can be defined within the theory are “automatically” within a certain complexity class. In such an account, the synta...
متن کاملAn Applicative Module Calculus
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, the subject-reduction property and the preservation of type abstraction seem to be incompatible. As a consequence, in relevant module systems, the theoretical study of reductions is meaningless, and for instance, the q...
متن کاملTowards a Theory of ( Self ) Applicative
In this paper a direct combination of the-calculus with concepts from concurrency is introduced. Abstraction and (self)application from the-calculus are maintained as primitive constructs in the combined calculus, which incorporates also notions of (non)deterministic choice, concurrent and sequential composition, communication, encapsulation and hiding as in Process Algebra (CCS, etc.). In this...
متن کاملAn Applicative Random-Access Stack
Applicative (functional) programming has long been advocated on theoretical grounds as the formal properties of such programs are simple and elegant. Recently, there has been a trend to bring the applicative approach into the practical arena as a software development tool [2] and even as a programming vehicle [1,6]. Unfortunately, the requirement that operations be side-effect free makes effici...
متن کاملProgramming language theory and its implementation - applicative and imperative paradigms
ions The description of the meaning of expressions just given above is vague and intuitive It took about years for logicians Dana Scott in fact to make it rigorous in a useful way We shall not be going into details of this Example x x denotes the identity function x x E E Example x f f x denotes the function which when applied to E yields f f x E x i e f f E This is the function which when appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.47.6